#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <fstream>
#include <set>
#include "tree.h"

using namespace std;

void getCloset(Tree *root, double target, double &diff, int &ans)
{
    if (!root) return;

    if (fabs(root->data - target) <  diff) {
	diff = fabs(root->data - target);
	ans = root->data;
    }
    
    if (root->data < target) {
	getCloset(root->right, target, diff, ans);
    }  else {
	getCloset(root->left, target, diff, ans);
    }
}


int main(int argc, char **argv)
{
    int input[] = {21,7,5,6,3,2,1,4,6,23,43,54,12,54,8,10,11,35,56};
    //int input[] = {7};
    Tree *root = NULL, *root2 = NULL;
    int result;

    for (int i = 0; i < sizeof(input)/sizeof(int); i++) {
        TreeInsert(root, input[i]);
    }

//    print_ascii_tree(root);

    int ans;
    double diff = 1000000.0;
    getCloset(root, 2.1, diff, ans);
    cout <<"closet is  " << ans << endl;
}
